TIME BOUNDS OF BASIC STEEPEST DESCENT ALGORITHMS FOR M-CONVEX FUNCTION MINIMIZATION AND RELATED PROBLEMS
نویسندگان
چکیده
منابع مشابه
Exact bounds for steepest descent algorithms of L-convex function minimization
We analyze minimization algorithms for L\-convex functions in discrete convex analysis, and establish exact bounds for the number of iterations required by the steepest descent algorithm and its variants.
متن کاملScaling Algorithms for M - convex Function Minimization
M-convex functions have various desirable properties as convexity in discrete optimization. We can find a global minimum of an M-convex function by a greedy algorithm, i.e., so-called descent algorithms work for the minimization. In this paper, we apply a scaling technique to a greedy algorithm and propose an efficient algorithm for the minimization of an M-convex function. Computational result...
متن کاملOn Steepest Descent Algorithms for Discrete Convex Functions
This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions, M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combination of the present results with a standard scaling approach leads to an efficient algor...
متن کاملOptimal Steepest Descent Algorithms for Unconstrained Convex Problems: Fine Tuning Nesterov’s Method
We modify the first order algorithm for convex programming proposed by Nesterov [5]. The resulting algorithm keeps the optimal complexity obtained by Nesterov with no need of a known Lipschitz constant for the gradient, and performs better in practically all examples in a set of test problems.
متن کاملRandom algorithms for convex minimization problems
This paper deals with iterative gradient and subgradient methods with random feasibility steps for solving constrained convex minimization problems, where the constraint set is specified as the intersection of possibly infinitely many constraint sets. Each constraint set is assumed to be given as a level set of a convex but not necessarily differentiable function. The proposed algorithms are ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2021
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.64.45